Query automata over finite trees
نویسندگان
چکیده
منابع مشابه
Comparing the Succinctness of Monadic Query Languages over Finite Trees
We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than mona...
متن کاملConjunctive Query Containment over Trees
The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child , NextSibling , their transitive and reflexive closures, and Following . For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or Π 2 -complete. For the satisfiability problem most problems ar...
متن کاملExtended finite automata over groups
Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abel...
متن کاملOn group automata over finite fields
We investigate the structure of incidence rings of group automata over finite fields. One of the major tools used in research on the structure of ring constructions is the Jacobson radical. Our main theorem gives a complete description of the Jacobson radicals of incidence rings of (possibly nondeterministic) group automata over finite fields in the important special case where the input group ...
متن کاملUnambiguous Finite Automata over a Unary Alphabet
Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguous finite automata (UFA). This paper considers UFAs over a one-letter alphabet, and determines the exact number of states in DFAs needed to represent unary languages recognized by n-state UFAs in terms of a new number-theoretic function g̃. The growth rate of g̃(n), and theref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00301-2